Minimal and Hyper-Minimal Biautomata
نویسندگان
چکیده
We compare deterministic finite automata (DFAs) and biautomata under the following two aspects: structural similarities between minimal and hyper-minimal automata, and computational complexity of the minimization and hyper-minimization problem. Concerning classical minimality, the known results such as isomorphism between minimal DFAs, and NL-completeness of the DFA minimization problem carry over to the biautomaton case. But surprisingly this is not the case for hyper-minimization: the similarity between almostequivalent hyper-minimal biautomata is not as strong as it is between almost-equivalent hyper-minimal DFAs. Moreover, while hyper-minimization is NL-complete for DFAs, we prove that this problem turns out to be computationally intractable, i.e., NP-complete, for biautomata.
منابع مشابه
On Biautomata
We initiate the theory and applications of biautomata. A biautomaton can read a word alternately from the left and from the right. We assign to each regular language L its canonical biautomaton. This structure plays, among all biautomata recognizing the language L, the same role as the minimal deterministic automaton has among all deterministic automata recognizing the language L. We expect tha...
متن کاملI-47: ART Outcome in PCOS Patients
PCOS is still a problem in gynecology and infertility. Especially in ART the problem of PCOS patients is bigger and more highlighted. These patients are prone to over and under stimulation. Strategies to overcome hyper stimulation are: use of metformin, ovarian drilling, use of minimal stimulation, suppressing LH with use of OCP or GnRh analogues, use of GnRh antagonist in COH. But none of thes...
متن کاملMINIMAL AND STATEWISE MINIMAL INTUITIONISTIC GENERAL L-FUZZY AUTOMATA
In this note, by considering the notions of the intuitionistic general L-fuzzy automaton and $(alpha, beta)$-language, we show that for any $(alpha, beta)$-language $mathcal{L}$, there exists a minimal intuitionistic general L-fuzzy automaton recognizing $mathcal{L}$.We prove that the minimal intuitionistic general L-fuzzy automaton is isomorphic with threshold $(alpha,beta)$ to any $(alpha, be...
متن کاملMinimal Model Generation Based on E-hyper Tableaux
Minimal model generation has received great attention as people have deeper and deeper understanding in the semantics of the logic programming, deductive database, non monotonic reasoning and the relationships among them. But most proposed minimal model generation procedures in the literature are inappropriate in the sense that while generating minimal model, they also generate non-minimal mode...
متن کاملFan-KKM Theorem in Minimal Vector Spaces and its Applications
In this paper, after reviewing some results in minimal space, some new results in this setting are given. We prove a generalized form of the Fan-KKM typetheorem in minimal vector spaces. As some applications, the open type of matching theorem and generalized form of the classical KKM theorem in minimal vector spaces are given.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Found. Comput. Sci.
دوره 27 شماره
صفحات -
تاریخ انتشار 2016